Model Checking of Recursive Probabilistic Systems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Online Appendix to: Model Checking of Recursive Probabilistic Systems

PROOF. It suffices, by standard facts about probability measure, to prove the claim for cylinders C(w′) ⊆ ′, where w′ = w0, . . . wk. We use induction on k. The base case (k = 0) follows from Lemma 7. Namely, C( ) = ′, and ρ−1( ′) = \ ρ−1( ). Thus Pr (ρ−1( ′)) = 1 − Pr (ρ−1( )) = 1. For the induction step, suppose that the claim holds for the prefix w′ = w0w1 . . . wk. Let D[w′] = ρ−1(C(w′)). D...

متن کامل

Model Checking Probabilistic Distributed Systems

Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilistic product automata (PPA) as a natural model for this kind of systems. To reason about these systems, we propose to use a product version of linear temporal logic (LTL). The main result of the paper is a model-checki...

متن کامل

Model Checking Durational Probabilistic Systems

We consider model-checking algorithms for durational probabilistic systems, which are systems exhibiting nondeterministic, probabilistic and discrete-timed behaviour. We present two semantics for durational probabilistic systems, and show how formulae of the probabilistic and timed temporal logic PTCTL can be verified on such systems. We also address complexity issues, in particular identifying...

متن کامل

Model Checking Hierarchical Probabilistic Systems

Probabilistic modeling is important for random distributed algorithms, bio-systems or decision processes. Probabilistic model checking is a systematic way of analyzing finite-state probabilistic models. Existing probabilistic model checkers have been designed for simple systems without hierarchy. In this paper, we extend the PAT toolkit to support probabilistic model checking of hierarchical co...

متن کامل

Model Checking of Probabilistic and Nondeterministic Systems

The temporal logics pCTL and pCTL* have been proposed as tools for the formal speci cation and veri cation of probabilistic systems: as they can express quantitative bounds on the probability of system evolutions, they can be used to specify system properties such as reliability and performance. In this paper, we present model-checking algorithms for extensions of pCTL and pCTL* to systems in w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Computational Logic

سال: 2012

ISSN: 1529-3785,1557-945X

DOI: 10.1145/2159531.2159534